A subspace covering problem in the n-cube

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

Maximal independent sets in the covering graph of the cube

Several familiar problems in extremal set theory can be cast as questions about the maximum possible size of an independent set defined on a suitable graph, about the total number of independent sets in such graphs, or about enumeration of the maximal independent sets. Here we find bounds on the number of maximal independent sets in the covering graph of a hypercube. © 2010 Elsevier B.V. All ri...

The N-Membranes Problem

a critical discourse analysis of the new york times and the tehran times news articles, covering the u.s.-led war in afghanistan

تحقیق حاضر متون خبری روزنامه های نیویورک تایمز و تهران تایمز را به صورت تحلیل انتقادی کلامی مورد بررسی قرارمی دهدکه درمورد جنگ به رهبری آ مریکا در افغانستان است. هدف از این تحقیق نشان دادن تاثیر ایدیولوژی و نگرشهای نویسندگان متون خبری است که ممکن است پنهان باشد. برای انجام این تحقیق 20 متن خبری) از هر روزنامه 10 متن خبری) به صورت تصادفی از سایت اینترنتی روزنامه های نیویورک تایمز و تهران تایمز ا...

PERCOLATION, FIRST-PASSAGE PERCOLATION, AND COVERING TIMES FOR RICHARDSON’S MODEL ON THE n-CUBE

Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube Bn = {0, 1} with nearest neighbor edges. For oriented and unoriented percolation, p = e/n and p = 1/n are the respective critical probabilities. For oriented first-passage percolation with i.i.d. edge-passage times having a density of 1 near the origin, the percolation time (time to reach the op...